An Adaptive Scalarization Method in Multiobjective Optimization
نویسندگان
چکیده
منابع مشابه
An Adaptive Scalarization Method in Multiobjective Optimization
This paper presents a new method for the numerical solution of nonlinear multiobjective optimization problems with an arbitrary partial ordering in the objective space induced by a closed pointed convex cone. This algorithm is based on the well-known scalarization approach by Pascoletti and Serafini and adaptively controls the scalarization parameters using new sensitivity results. The computed...
متن کاملAdaptive Scalarization Methods in Multiobjective Optimization
Only for you today! Discover your favourite adaptive scalarization methods in multiobjective optimization book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available to download. One of them is this adaptive scalarization methods in multiobjective optimization ...
متن کاملConic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantee to generate all proper efficient solutions and does not require any kind of cenvexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideretion by this method. Also in this paper,...
متن کاملAdaptive Weighted Sum Method for Multiobjective Optimization
This paper presents an adaptive weighted sum method for multiobjective optimization problems. The authors developed the bi-objective adaptive weighted sum method, which determines uniformly-spaced Pareto optimal solutions, finds solutions on non-convex regions, and neglects non-Pareto optimal solutions. However, the method could solve only problems with two objective functions. In this work, th...
متن کاملA logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on R and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced on the quadratic term and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2009
ISSN: 1052-6234,1095-7189
DOI: 10.1137/060672029